Majority logic decodable codes derived from finite inversive planes
نویسندگان
چکیده
منابع مشابه
One-point extensions of finite inversive planes
A one-point extension of an egglike inversive plane of order n exists if, and only if, n is 2 or 3. Hence there are no 4-(18,6,1) designs and no 4-(66,10,1) designs. An inversive plane of order n is a one-point extension of an affine plane of ordern, that is, a 3-(n + 1,n + 1,1) design. An ovoid of PG(3, q), q > 2, is a set of q2 + 1 points, no three collinear. An ovoid of PG(3, 2) is a set of ...
متن کاملPerformance Analaysis of Low-Density Parity-Check Codes Derived from Finite Inversive Spaces
Low Density Parity Check (LDPC) codes have been the center of numerous researches in the last ten years. The reason for this interest is due to the performance (Error ratio over SNR) that these codes can achieve keeping the complexity of the pair coding/decoding to a level lower than other codes such as Turbo codes. This project aims to continue and intensify performance simulations on LDPC cod...
متن کاملIterative Threshold Decoding of Majority Logic Decodable Codes on Rayleigh Fading Channels
Iterative threshold decoding of product and parallel concatenated block codes based on one step majority logic decodable (OSMLD) codes has proven to perform remarkably well on AWGN channels. For these codes to be applicable in wireless environment, their performance on fading channels must be examined. The purpose of this work is to study the performance of our iterative threshold decoding algo...
متن کاملOn a Class of One-Step Majority-Logic Decodable Cyclic Codes
Majority-logic decoding is attractive for three reasons: (I) It can be simply implemented; (2 ) the decoding delay is short; and (3) its performance, while suboptimal, is always superior to bounded distance decoding. For these reasons, majoritylogic decodable cyclic codes are very suitable f o r error control in high speed digital data transmission systems. Among the majority-logic decodable co...
متن کاملA New Iterative Threshold Decoding Algorithm for One Step Majority Logic Decodable Block Codes
The performance of iterative decoding algorithm for one-step majority logic decodable (OSMLD) codes is investigated. We introduce a new soft-in soft-out of APP threshold algorithm which is able to decode theses codes nearly as well as belief propagation (BP) algorithm. However the computation time of the proposed algorithm is very low. The developed algorithm can also be applied to product code...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1971
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(71)90428-1